Improving Cost-Optimal Domain-Independent Symbolic Planning
نویسندگان
چکیده
Symbolic search with BDDs has shown remarkable performance for cost-optimal deterministic planning by exploiting a succinct representation and exploration of state sets. In this paper we enhance BDD-based planning by applying a combination of domain-independent search techniques: the optimization of the variable ordering in the BDD by approximating the linear arrangement problem, pattern selection for improved construction of search heuristics in form of symbolic partial pattern databases, and a decision procedure for the amount of bidirection in the symbolic search process.
منابع مشابه
Partial Symbolic Pattern Databases for Optimal Sequential Planning
This paper investigates symbolic heuristic search with BDDs for solving domain-independent action planning problems cost-optimally. By distributing the impact of operators that take part in several abstractions, multiple partial symbolic pattern databases are added for an admissible heuristic, even if the selected patterns are not disjoint. As a trade-off between symbolic bidirectional and heur...
متن کاملCost-Optimal Symbolic Abduction for Improved Security
Abduction is a backward inference process for generating and narrowing hypotheses. It has been applied for plan recognition and diagnosis and is crucial for detecting attack plans security applications. Cost-optimal abduction drives the selection of hypotheses towards the ones with minimal costs. Abduction is inherently complex. In this paper, we describe solutions for overcoming the computatio...
متن کاملOptimal Symbolic Planning with Action Costs and Preferences
This paper studies the solving of finite-domain action planning problems with discrete action costs and soft constraints. For sequential optimal planning, a symbolic perimeter database heuristic is addressed in a bucket implementation of A*. For computing net-benefits, we propose symbolic branch-and-bound search together with some search refinements. The net-benefit we optimize is the total ben...
متن کاملSymbolic Pattern Databases in Heuristic Search Planning
This paper invents symbolic pattern databases (SPDB) to combine two influencing aspects for recent progress in domain-independent action planning, namely heuristic search and model checking. SPDBs are off-line computed dictionaries, generated in symbolic backward traversals of automatically inferred planning space abstractions. The entries of SPDBs serve as heuristic estimates to accelerate exp...
متن کاملAdmissible Heuristics for Automated Planning
The problem of domain-independent automated planning has been a topic of research in Artificial Intelligence since the very beginnings of the field. Due to the desire not to rely on vast quantities of problem specific knowledge, the most widely adopted approach to automated planning is search. The topic of this thesis is the development of methods for achieving effective search control for doma...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011